First-Order Mixed Integer Linear Programming Geoffrey J. Gordon Machine Learning Department Carnegie Mellon University Pittsburgh, PA 15213

Source URL: select.cs.cmu.edu

• Logic
• Mathematical logic
• Abstraction
• Automated theorem proving
• Model theory
• Predicate logic
• Semantics
• Boolean algebra
• Resolution
• Cutting-plane method
• First-order logic
• Propositional calculus

The (λ, κ)-FN and the order theory of bases in boolean algebras David Milovich Texas A&M International University http://www.tamiu.edu/∼dmilovich/

Source URL: spot.colorado.edu

• Large cardinals
• Mathematical logic
• Mathematics
• Abstraction
• Cardinal number
• Free Boolean algebra
• Model theory
• Mahlo cardinal
• Weakly compact cardinal

THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of

Source URL: ludovicpatey.com

• Automated theorem proving
• Logic programming
• Logic in computer science
• Boolean algebra
• Model theory
• Substitution
• Boolean satisfiability problem
• Interpretation
• Relationships among probability distributions
• Lifting theory

École Doctorale de l’École polytechnique I NRIA THÈSE DE DOCTORAT Présentée par

Source URL: cedeela.fr

• Mathematical logic
• Mathematics
• Logic
• Boolean algebra
• First-order logic
• Propositional calculus
• FO
• Quantifier
• Boolean satisfiability problem
• True quantified Boolean formula
• Model theory
• Peano axioms

First-order satisfiability in Gödel logics: an NP-complete fragment Matthias Baaza,1 , Agata Ciabattonia,2 , Norbert Preininga,b,3 a b

Source URL: www.preining.info

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Non-classical logic
• Logic in computer science
• Predicate logic
• First-order logic
• Boolean satisfiability problem
• Gdel numbering
• Many-valued logic
• Kripke semantics

1 Potassco: The Potsdam Answer Set Solving Collection Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub, and Marius Schneider

Source URL: www.cs.uni-potsdam.de

• Logic programming
• NP-complete problems
• Operations research
• Constraint programming
• Answer set programming
• Logic in computer science
• Boolean satisfiability problem
• Algorithm
• Solver
• Stable model semantics
• AMPL
• Constraint satisfaction problem

Genome Informatics 16(2): 225–Reconstruction of Gene Regulatory Networks under the Finite State Linear Model

Source URL: www.jsbi.org

• Biology
• Systems biology
• Bioinformatics
• Systems science
• Networks
• Gene expression
• Molecular biology
• Gene regulatory network
• Gene
• Biological network
• Boolean network
• Promoter

A Generalization of St˚ almarck’s Method⋆ Aditya Thakur1 and Thomas Reps1,2⋆⋆ 1 University of Wisconsin; Madison, WI, USA

Source URL: research.cs.wisc.edu

• Logic
• Mathematics
• Mathematical logic
• Boolean algebra
• Propositional calculus
• Model theory
• Propositions
• Propositional formula
• Interpretation
• Tautology
• Distributive property
• Closure

Crossed Exponentially Tapered Slots Antenna (XETS) - CAD Model Import and Simulation By using only one boolean union operation, we turn the whole model into a single body ready for material assignment and meshing. In fac

Source URL: www.wipl-d.jp

PUBLICATIONS OF RONALD MEESTER Articles mathematics 1. The asymptotics of group Russian roulette (with Tim van de Brug and Wouter Kager), submittedUniquely determined uniform probability on the natural number

Source URL: www.cs.vu.nl

• Physics
• Critical phenomena
• Lattice models
• Discrete mathematics
• Percolation
• Systems theory
• Self-organized criticality
• Boolean model
• Probability theory
• Combinatorics
• Mathematics